Session-based Type Discipline for Pi Calculus with Matching
نویسندگان
چکیده
does not allow the transmission of an arbitrary channel. In most situations a receiving process k?(k′′).Q can be alpha-converted ahead of communication so that the bound channel k′′ syntactically matches the free channel k′ in the object of the sending process [11]. The exception happens exactly when k′ is free in Q: alpha-conversion becomes impossible (for it would capture the free variable k′), and communication cannot occur. A more liberal rule allows the transmission of an arbitrary channel, implying a substitution on the client side.
منابع مشابه
Algorithmic type checking for a pi-calculus with name matching and session types
We present a type checking algorithm for establishing a session-based discipline in a π-calculus with name matching. We account for analyzing processes exhibiting different behaviours in the branches of the if-then-else by imposing an affine discipline for session types. This permits to obtain type-safety or absence of communication errors while accepting processes of the form ifx = y thenP els...
متن کاملA type checking algorithm for qualified session types
We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constru...
متن کاملReversible session-based pi-calculus
In this work, we incorporate reversibility into structured communication-based programming, to allow parties of a session to automatically undo, ina rollback fashion, the effect of previously executed interactions. This per-mits to take different computation paths along the same session, as wellas to revert the whole session and starting a new one. Our aim is to de-fine a th...
متن کاملFull Abstraction in a Subtyped pi-Calculus with Linear Types
We introduce a concise pi-calculus with directed choices and develop a theory of subtyping. Built on a simple behavioural intuition, the calculus offers exact semantic analysis of the extant notions of subtyping in functional programming languages and session-based programming languages. After illustrating the idea of subtyping through examples, we show type-directed embeddings of two known sub...
متن کاملA Linear Account of Session Types in the Pi Calculus
We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times. We equip types with a constructor that denotes the two ends of a same communication channel. In order to assess the flexibility of the new type system, we prov...
متن کامل